The Tait Flyping Conjecture
نویسندگان
چکیده
We announce a proof of the Tait flyping conjecture; the confirmation of this conjecture renders almost trivial the problem of deciding whether two given alternating link diagrams represent equivalent links. The proof of the conjecture also shows that alternating links have no "hidden" symmetries. In the nineteenth century, the celebrated physicist and knot tabulator P. G. Tait proposed the following conjecture: given reduced, prime alternating diagrams D{, D2 of a knot (or link), it is possible to transform Dj to D2 by a sequence of flypes, where a flype is a transformation most easily described by the pictures of Figure 1 on p. 404. In performing a flype, the tangle represented by the shaded disc labelled SA is turned upside-down so that the crossing to its left is removed by untwisting, and a new crossing is created to its right; if the tangle diagram SA has no crossing, the flype leaves the link diagram unchanged up to isomorphism, whereas if the tangle diagram SB should have no crossing, the flype amounts merely to a rotation of the complete link diagram about an axis in the projection 2-sphere. During the last few years, some partial results have appeared; in particular it follows from the analysis of [B-S] on arborescent links that any two alternating diagrams of a link which are algebraic (i.e. which have Conway basic polyhedron 1*) must be related via a sequence of flypes. A slightly stronger version of this result is set forth in [T4], where the conclusion is obtained for a pair of alternating diagrams only one of which is given as algebraic. It follows from the results of [B-M] that the Tait conjecture holds for link diagrams which are closures of alternating 3-string braid diagrams. K. Murasugi and J. Przytycki [M-P] have proved a number of results on graph polynomials which have lent support to the conjecture. Very recently, A. Schrijver [S] has announced Received by the editors January 20, 1991. 1980 Mathematics Subject Classification (1985 Revision). Primary 57M25. The first author was partially supported by NSF Grant no. DMS 9002673. ©1991 American Mathematical Society 0273-0979/91 $1.00+ $.25 per page 403 404 W. W. MENASCO AND M. B. THISTLETHWAITE
منابع مشابه
Tait's flyping conjecture for 4-regular graphs
Tait’s flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S. The proof of this version of the flyping conjecture is based on the fact that the equivalence classes with respect to ambient isotopy and rigid vertex isotopy of graph embeddings are i...
متن کاملMatrix Models an Knot Theory
We shall explain how knot, link and tangle enumeration problems can be expressed as matrix integrals which will allow us to use quantum field-theoretic methods. We shall discuss the asymptotic behaviors for a great number of intersections. We shall detail algorithms used to test our conjectures. 1. Classification and Enumeration of Knots, Links, Tangles A knot is defined as a closed, non-self-i...
متن کاملA Survey & Strengthening of Barnette’s Conjecture
Tait and Tutte made famous conjectures stating that all members of certain graph classes contain Hamiltonian Cycles. Although the Tait and Tutte conjectures were disproved, Barnette continued this tradition by conjecturing that all planar, cubic, 3-connected, bipartite graphs are Hamiltonian, a problem that has remained open since its formulation in the late 1960s. This paper has a twofold purp...
متن کاملProof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree
We establish a conjecture of Graham and Lovász that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal; we also prove they are log-concave. Email addresses: [email protected] (Ghodratollah Aalipour), [email protected] (Aida Abiad), [email protected] (Zhanar Berikkyzy), [email protected] (Leslie Hogben), [email protected] (Fra...
متن کاملUnknotting number and knot diagram
TImis note is a continuation of [Nl], Wbere we have discusged tbe unknotting number of knots With rspect tía knot diagrams. Wc wilI show that for every minimum-crossing knot-diagram among ah unknotting-number-one two-bridge knot there exist crossings whose exchangeyields tIme trivial knot, ib tbe tbird Tait conjecture is true.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007